Cover Attacks for Elliptic Curves over Cubic Extension Fields
نویسندگان
چکیده
We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields $${\mathbb {F}}_{q^3}$$ . It is based on transfer: First an {F}}_q$$ -rational $$(\ell ,\ell )$$ -isogeny from Weil restriction of under consideration with respect {F}}_{q^3}/{\mathbb Jacobian variety genus three applied and then solved in via index-calculus attacks. Although it uses no covering maps construction desired homomorphism, this method is, sense, kind cover attack. As result, possible solve some groups prime order time $${\tilde{O}}(q)$$
منابع مشابه
Torsion of elliptic curves over cubic fields
Although it is not known which groups can appear as torsion groups of elliptic curves over cubic number fields, it is known which groups can appear for infinitely many non-isomorphic curves. We denote the set of these groups as S. In this paper we deal with three problems concerning the torsion of elliptic curves over cubic fields. First, we study the possible torsion groups of elliptic curves ...
متن کاملNo 17-torsion on elliptic curves over cubic number fields
Consider, for d an integer, the set S(d) of prime numbers p such that: there exists a number field K of degree d, an elliptic curve E overK, and a point P in E(K) of order p. It is a well-known theorem of Mazur, Kamienny, Abramovich and Merel that S(d) is finite for every d; moreover S(1) and S(2) are known. In [7], we tried to answer a question of Kamienny and Mazur by determining S(3), and we...
متن کاملTorsion of Rational Elliptic Curves over Cubic Fields
Let E be an elliptic curve defined over Q. We study the relationship between the torsion subgroup E(Q)tors and the torsion subgroup E(K)tors, where K is a cubic number field. In particular, we study the number of cubic number fields K such that E(Q)tors ̸= E(K)tors.
متن کاملHow Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard rho. We give details of a theoretical and practical comparison and then use this to analyse the difficulty of actually solving the ECDLP for curves of the size needed in practical cryptographic systems. We show that co...
متن کاملOn Efficient Pairings on Elliptic Curves over Extension Fields
In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2023
ISSN: ['0933-2790', '1432-1378']
DOI: https://doi.org/10.1007/s00145-023-09474-2